Optimal Networks for Mass Transportation Problems
نویسندگان
چکیده
In the framework of transport theory, we are interested in the following optimization problem: given the distributions μ of working people and μ− of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of μ from μ− with respect to a metric which depends on the transportation network. Mathematics Subject Classification. 49J45, 49Q10, 90B10. Received October 21, 2003.
منابع مشابه
Limit Theorems for Optimal Mass Transportation and Applications to Networks
It is shown that optimal network plans can be obtained as a limit of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms.
متن کاملOptimal networks by mass transportation via point allocation
It is shown that optimal network plans can be obtained, naturally, as a limit of easier problems of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms. Each of these problems can be solved by minimizing a function of a finite, prescribed number of variables.
متن کاملOptimal networks by mass transportation via points allocation
It is shown that optimal network plans can be obtain, naturally, as a limit of easier problems of points allocations. These point allocation problem are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms, each can be solved by linear programming.
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملThree Optimization Problems in Mass Transportation Theory
We give a model for the description of an urban transportation network and we consider the related optimization problem which consists in finding the desing of the network which has the best transportation performances. This will be done by introducing, for every admissible network, a suitable metric space with a distance that inserted into the Monge-Kantorovich cost functional provides the cri...
متن کاملProfit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کامل